Approximate Sparse Recovery: Optimizing Time and Measurements
نویسندگان
چکیده
منابع مشابه
( 1 + ) - approximate Sparse Recovery
The problem central to sparse recovery and compressive sensing is that of stable sparse recovery: we want a distribution A of matrices A ∈ Rm×n such that, for any x ∈ R and with probability 1−δ > 2/3 over A ∈ A, there is an algorithm to recover x̂ from Ax with ‖x̂− x‖p ≤ C min k-sparse x′ ∥∥x− x′∥∥ p (1) for some constant C > 1 and norm p. The measurement complexity of this problem is well unders...
متن کاملSparse Recovery from Saturated Measurements
A novel theory of sparse recovery is presented in order to bridge the standard compressive sensing framework and the one-bit compressive sensing framework. In the former setting, sparse vectors observed via few linear measurements can be reconstructed exactly. In the latter setting, the linear measurements are only available through their signs, so exact reconstruction of sparse vectors is repl...
متن کاملJoint-sparse recovery from multiple measurements
The joint-sparse recovery problem aims to recover, from sets of compressed measurements, unknown sparse matrices with nonzero entries restricted to a subset of rows. This is an extension of the single-measurement-vector (SMV) problem widely studied in compressed sensing. We analyze the recovery properties for two types of recovery algorithms. First, we show that recovery using sum-of-norm minim...
متن کاملSparse Signal Recovery from Nonadaptive Linear Measurements
The theory of Compressed Sensing , the emerging sampling paradigm ‘that goes against the common wisdom’ , asserts that ‘one can recover signals in R from far fewer samples or measurements , if the signal has a sparse representation in some orthonormal basis, from m ≈ O(klogn), k ≪ n nonadaptive measurements . The accuracy of the recovered signal is as good as that attainable with direct knowled...
متن کاملSparse Support Recovery with Phase-Only Measurements
Sparse support recovery (SSR) is an important part of the compressive sensing (CS). Most of the current SSR methods are with the full information measurements. But in practice the amplitude part of the measurements may be seriously destroyed. The corrupted measurements mismatch the current SSR algorithms, which leads to serious performance degeneration. This paper considers the problem of SSR w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2012
ISSN: 0097-5397,1095-7111
DOI: 10.1137/100816705